Posets and VPG Graphs
نویسندگان
چکیده
We investigate the class of intersection graphs of paths on a grid (VPG graphs), and specifically the relationship between the bending number of a cocomparability graph and the poset dimension of its complement. We show that the bending number of a cocomparability graph G is at most the poset dimension of the complement of G minus one. Then, via Ramsey type arguments, we show our upper bound is best possible.
منابع مشابه
String graphs of k-bend paths on a grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. If the number k of bends is not restricted, then the VPG graphs are shown to be equivalent to the well-known class of string graphs, namely, the in...
متن کاملBend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
In this paper we study properties of intersection graphs of kbend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by Bk-VPG. We show here that for every fixed k, Bk-VPG ( Bk+1-VPG and that recognition of graphs from Bk-VPG is NP-complete even when the input graph is given by a Bk...
متن کاملPlanar Graphs as VPG-Graphs
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG. We also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a...
متن کاملVertex Intersection Graphs of Paths on a Grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. In chip manufacturing, circuit layout is modeled as paths (wires) on a grid, where it is natural to constrain the number of bends per wire for reas...
متن کاملRecognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as B0-VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0-VPG graphs, and for recognizing B0-VPG graphs that have a representation on a grid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 33 شماره
صفحات -
تاریخ انتشار 2016